How many subsets of edges of a directed multigraph can be represented as trails?
نویسنده
چکیده
For each subset of edges of a (directed multi-) graph, one may determine whether the edges can be represented as a trail; for each graph, the fraction of trail-representable subsets out of the total number of subsets of edges. How large can this fraction be as a function of the number edges m? I give an upper bound of O( √ logm/ √ m) and show by example that the upper bound is nearly tight.
منابع مشابه
One-Way Trail Orientations
Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins’ theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is 2-edge connected. A natural extension of this problem is the following: Suppose that the edges of the graph is partitioned into trails. Can we orient the tr...
متن کاملOn Multigraph Extremal Problems
1 . Introduction . In this paper we shall consider multigraphs and digraphs (= directed graphs) with bounded multiplicity : an integer r is fixed and we shall assume, that the considered multigraphs or digraphs have no loops, further, if u and v are two vertices of a multigraph M, they can be joined by more than one edge, however, they cannot be joined by more than r edges. In case of digraphs ...
متن کاملVisual Adjacency Multigraphs – a Novel Approach for a Web Page Classification
Standard techniques for a web page classification usually take a simple text-based approach, in which most of the information provided by the visual layout of a page is discarded. In our work we propose a new classification approach based on the visual layout analyses, conducted before implementing standard classification techniques. A page is represented as a hierarchical structure – Visual Ad...
متن کاملBelow All Subsets for Some Permutational Counting Problems
We show that the two problems of computing the permanent of an n × n matrix of poly(n)-bit integers and counting the number of Hamiltonian cycles in a directed n-vertex multigraph with exp(poly(n)) edges can be reduced to relatively few smaller instances of themselves. In effect we derive the first deterministic algorithms for these two problems that run in o(2) time in the worst case. Classic ...
متن کاملPacking Digraphs With Directed Closed Trails
It has been shown [Balister, 2001] that if n is odd and m1, . . . , mt are integers with mi ≥ 3 and ∑t i=1 mi = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m1, . . . , mt. This result was later generalized [Balister, to appear] to all sufficiently dense Eulerian graphs G in place of Kn. In this article we consider the corresponding questions for direc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1606.09107 شماره
صفحات -
تاریخ انتشار 2016